Computational irreducibility - PDFSEARCH.IO - Document Search Engine

Computational irreducibility
Results: 18

#	Item
11	Undecidability and Intractability in Theoretical PhysicsPhysical processes are viewed as computations, and the difficulty of answering Add to Reading List Source URL: www.stephenwolfram.com Language: English - Date: 2013-09-24 11:02:15 Computability theory Theory of computation Structural complexity theory Computational problems Cellular automaton Computational irreducibility A New Kind of Science Turing machine P versus NP problem Theoretical computer science Applied mathematics Mathematics
12	On the linear complexity of Sidel’nikov Sequences over nonprime fields Nina Brandst¨atter a , Wilfried Meidl b a Johann Radon Institute for Computational and Applied Mathematics, Austrian Add to Reading List Source URL: research.sabanciuniv.edu Language: English - Date: 2008-06-03 16:50:30 Finite fields Binomial coefficient Combinatorics Coding theory Euclidean algorithm Factorization of polynomials over a finite field and irreducibility tests Mathematics Abstract algebra Polynomials
13	CONCEPTS & THEORY The limits to prediction in ecological systems BRIAN BECKAGE,1, LOUIS J. GROSS,2 2 Add to Reading List Source URL: www.uvm.edu Language: English - Date: 2012-02-11 18:16:17 Knowledge Mathematical and theoretical biology Computational irreducibility Information theory Theoretical computer science Ecological succession Predictability Theoretical ecology Chaos theory Biology Science Ecology
14	More complex complexity: Exploring the nature of computational irreducibility across physical, biological, and human social systems Brian Beckage1 , Stuart Kauffman2 , Asim Zia3 , Christopher Koliba4 , and Louis J. Gross Add to Reading List Source URL: www.uvm.edu Language: English - Date: 2013-09-13 12:37:01 Systems theory Complex systems theory Ethology Systems Computational neuroscience Computational irreducibility Complexity Cellular automaton Complex systems Science Cybernetics Knowledge
15	From coding theory to efficient pattern matching Rapha¨el Clifford University of Bristol, Dept. of Computer Science Bristol, BS8 1UB, UK [removed] Klim Efremenko Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:17 Analysis of algorithms Probabilistic complexity theory Time complexity Matching Factorial Approximate string matching Randomized algorithm Big O notation Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory
16	CS255: Introduction to Cryptography Winter 2014 Assignment #3: Solutions Answer 1. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-03-18 01:08:22 Computational science Cryptography Coding theory Public-key cryptography Factorization of polynomials over a finite field and irreducibility tests Lenstra elliptic curve factorization Mathematics Euclidean algorithm Finite fields
17	Data reduction for weighted and outlier-resistant clustering Add to Reading List Source URL: siam.omnibooksonline.com Language: English - Date: 2011-11-18 11:45:34 Cook–Levin theorem Factorization of polynomials over a finite field and irreducibility tests Mathematics Modular arithmetic Computational complexity theory
18	PDF Document Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2010-03-11 22:26:05 Probabilistic complexity theory Sipser–Lautemann theorem Structural complexity theory IP Bounded-error probabilistic polynomial FO Polynomials Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Computational complexity theory Applied mathematics

UPDATE